In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent

نویسندگان

چکیده

A Kempe swap in a proper coloring interchanges the colors on some maximal connected 2-colored subgraph. Two k-colorings are k-equivalent if we can transform one into other using swaps. The triangulated toroidal grid, T[m×n], is formed from (a embedding of) Cartesian product of Cm and Cn by adding parallel diagonals inside all 4-faces. Mohar Salas showed that not 4-colorings T[m×n] 4-equivalent. In contrast, Bonamy, Bousquet, Feghali, Johnson 6-colorings 6-equivalent. They asked whether same true for 5-colorings. We answer their question affirmatively when m,n≥6. Further, show G 6-regular with where every non-contractible cycle has length at least 7, then 5-colorings 5-equivalent. Our results relate to antiferromagnetic Pott’s model statistical mechanics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kempe Equivalence of Colorings

Several basic theorems about the chromatic number of graphs can be extended to results in which, in addition to the existence of a kcoloring, it is also shown that all k-colorings of the graph in question are Kempe equivalent. Here, it is also proved that for a planar graph with chromatic number less than k, all k-colorings are Kempe equivalent.

متن کامل

Most Regular Graphs Are Quickly R-transitive

Consider a d-regular directed graph, G, on n vertices determined by d permutations 1; : : : ; d 2 Sn. Each word, w, over the alphabet = f 1; 2; : : : ; dg determines a walk at each vertex, and these walks give rise to a permutation of the vertices (which is simply the product of the permutations). Such a word maps a distinct r-tuple of vertices, (v1; : : : ; vr) to another distinct r-tuple of v...

متن کامل

5-Connected Toroidal Graphs are Hamiltonian-Connected

The problem on the Hamiltonicity of graphs is well studied in discrete algorithm and graph theory, because of its relation to traveling salesman problem (TSP). Starting with Tutte’s result, stating that every 4-connected planar graph is Hamiltonian, several researchers have studied the Hamiltonicity of graphs on surfaces. Extending Tutte’s technique, Thomassen proved that every 4-connected plan...

متن کامل

Largest 6-regular toroidal graphs for a given diameter

We show that a 6-regular graph of diameter d embedded on the torus can have at most 3d + 3d+ 1 vertices having exhibited a graph of this order for each d ≥ 1. 1 6-regular Toroidal Graphs In [1] it is proven that all 6-regular toroidal graphs can have their vertices arranged in a rectangular based grid structure with parallel diagonals across every sub-rectangle in the grid. A special case of th...

متن کامل

Irregular colorings of regular graphs

An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbors. In algebraic graph theory, graphs with a certain amount of symmetry can sometimes be specified in terms of a group and a smaller graph called a voltage graph. In [3], Radcliffe and Zhang found a bound for the irregular chromatic nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2022

ISSN: ['1095-9971', '0195-6698']

DOI: https://doi.org/10.1016/j.ejc.2022.103532